The limitedness problem on distance automata: Hashiguchi's method revisited
نویسندگان
چکیده
منابع مشابه
The limitedness problem on distance automata: Hashiguchi's method revisited
Hashiguchi has studied the limitedness problem of distance automata (DA) in a series of paper ([3], [6] and [7]). The distance of a DA can be limited or unbounded. Given that the distance of a DA is limited, Hashiguchi has proved in [7] that the distance of the automaton is bounded by 2 3+n , where n is the number of states. In this paper, we study again Hashiguchi’s solution to the limitedness...
متن کاملLimitedness Theorem on Finite Automata with Distance Functions: An Algebraic Proof
A finite automaton .d with a distance function d is a sextuple, (C, Q, M, S, F, d), such that C is the input alphabet, Q is the finite set of states, M: Q x C -+ 2Q is the transition function, S c Q and F c Q are the sets of initial and final states, respectively, d: Q x C x Q -+ (0, 1, co } is the distance function, where co denotes infinity, and d satisfies the following: for any (q,a,q’)E Q ...
متن کاملDistance Desert Automata and the Star Height One Problem
We show that it is decidable in time complexity 2 2O(n) whether the language accepted by an n-state non-deterministic automaton is of star height one, which is the first ever complexity result for the star height one problem. To achieve this, we introduce distance desert automata as a joint generalization of distance automata and desert automata, and show the decidability of its limitedness pro...
متن کاملOn the subgroup distance problem
We investigate the computational complexity of finding an element of a permutation group H ⊆ Sn with a minimal distance to a given π ∈ Sn, for different metrics on Sn. We assume that H is given by a set of generators, such that the problem cannot be solved in polynomial time by exhaustive enumeration. For the case of the Cayley Distance, this problem has been shown to be NP-hard, even if H is a...
متن کاملHigher dimensional automata revisited
The dual of a true concurrency schedule appears to be a false concurrency automaton, a paradox we resolved in a previous paper by extending the latter to higher dimensions. This extension may be formalized via such discrete geometries as n-categories, simplicial complexes, cubical complexes, and Chu spaces. We advocate the last as having a clear notion of event, a well-defined process algebra u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(03)00377-3